Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices

This paper deals with a secret key agreement problem from correlated random numbers. It is proved that there is a pair of linear matrices that yields a secret key agreement in the situation wherein a sender, a legitimate receiver, and an eavesdropper have access to correlated random numbers. A relation between the coding problem of correlated sources and a secret key agreement problem from correlated random numbers are also discussed. key words: common information, cryptography, linear codes, low density parity check codes, multi-terminal source coding, secret key agreement, secret key capacity